On Bus Graph Realizability
نویسندگان
چکیده
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2;E), where the maximum degree of vertices in V2 is 4, can G be embedded on a two dimensional grid such that each vertex in V1 is drawn as a line segment along a grid line, each vertex in V2 is drawn as a point at a grid point, and each edge e = (u, v) for some u ∈ V1 and v ∈ V2 is drawn as a line segment connecting u and v, perpendicular to the line segment for u? We show that this problem is NP-complete, and sketch how our proof techniques can be used to show the hardness of several other related problems.
منابع مشابه
A note on α-drawable k-trees
We study the problem of realizing a given graph as an α-complex of a set of points in the plane. We study the realizability problem for trees and 2-trees. In the case of 2-trees, we confine our attention to the realizability of graphs as the α-complex minus faces of dimension two; in other words, realizability of the graph in terms of the 1-skeleton of the α-complex of the point set. We obtain ...
متن کاملA graph search algorithm: Optimal placement of passive harmonic filters in a power system
The harmonic in distribution systems becomes an important problem due to an increase in nonlinear loads. This paper presents a new approach based on a graph algorithm for optimum placement of passive harmonic filters in a multi-bus system, which suffers from harmonic current sources. The objective of this paper is to minimize the network loss, the cost of the filter and the total harmonic disto...
متن کاملRealizable Paths and the NL vs L Problem
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete problem) using O(logn) space, implying NL ⊆ DSPACE(logn). While Savitch’s theorem itself has not been improved in the last four decades, studying the space complexity of several special cases of STCONNECTIVITY has provided new ...
متن کاملUnidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences
In this paper we use the concept of integer-pair sequences, an invariant of graphs and digraphs introduced in Hakimi and Patrinos [9], and results on its unique realizability, in Das [4,5], to obtain results on the unique realizability of degree sequences, another invariant of graphs and digraphs. We thus present a unified approach to solving the problem of unique realizability of these two inv...
متن کاملHardware Mechanism and Performance Evaluation of Hierarchical Page-Based Memory Bus Protection
SecBus project aims at building a two-level pagebased memory bus protection platform. A trusted Operating System (OS) dynamically manages security contexts for memory pages. Via such contexts, an independent hardware module is driven to execute cryptographic protections. The fact that both processor and software tool chain are not modified strengthens platform realizability and market acceptabi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007